PSOM2—partitioning-based scalable ontology matching using MapReduce
نویسندگان
چکیده
منابع مشابه
LogMap: Logic-Based and Scalable Ontology Matching
In this paper, we present LogMap—a highly scalable ontology matching system with ‘built-in’ reasoning and diagnosis capabilities. To the best of our knowledge, LogMap is the only matching system that can deal with semantically rich ontologies containing tens (and even hundreds) of thousands of classes. In contrast to most existing tools, LogMap also implements algorithms for ‘on the fly’ unsati...
متن کاملScalable Matching of Ontology Graphs Using Partitioning
The problem of ontology matching is crucial due to decentralized development and publication of ontological data. An approach proposed towards matching the ontologies is by inferring a match between two ontologies as a maximum likelihood problem, and solves it using the technique of expectation maximization (EM). The structural and lexical similarities between the graphs are identified in this ...
متن کاملConstructing Virtual Documents for Ontology Matching Using MapReduce
Ontology matching is a crucial task for data integration and management on the Semantic Web. The ontology matching techniques today can solve many problems from heterogeneity of ontologies to some extent. However, for matching large ontologies, most ontology matchers take too long run time and have strong requirements on running environment. Based on the MapReduce framework and the virtual docu...
متن کاملOntology Based Document Clustering Using MapReduce
Nowadays, document clustering is considered as a data intensive task due to the dramatic, fast increase in the number of available documents. Nevertheless, the features that represent those documents are also too large. The most common method for representing documents is the vector space model, which represents document features as a bag of words and does not represent semantic relations betwe...
متن کاملScalable Distributed Reasoning Using MapReduce
We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach on top of Hadoop and deployed it on a compute cluster of up to 64 commodity machines. We show that a naive implementation on top of MapReduce is straightforward but performs badly and we present several non-trivial opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sādhanā
سال: 2017
ISSN: 0256-2499,0973-7677
DOI: 10.1007/s12046-017-0742-5